On reachability mixed arborescence packing
نویسندگان
چکیده
منابع مشابه
Reachability-based matroid-restricted packing of arborescences
The fundamental result of Edmonds [5] started the area of packing arborescences and the great number of recent results shows increasing interest of this subject. Two types of matroid constraints were added to the problem in [2, 3, 9], here we show that both contraints can be added simultaneously. This way we provide a solution to a common generalization of the reachability-based packing of arbo...
متن کاملIndependent and maximal branching packing in infinite matroid-rooted digraphs
We prove a common generalization of the maximal independent arborescence packing theorem of Cs. Király [13] (which itself is a common generalization of the reachability based arborescence packing result [12] and a matroid based arborescence packing result [5]) and two of our earlier works about packing branchings in infinite digraphs, namely [9] and [11].
متن کاملOnline Mixed Packing and Covering
In many problems, the inputs to the problem arrive over time. As each input is received, it must be dealt with irrevocably. Such problems are online problems. An increasingly common method of solving online problems is to solve the corresponding linear program, obtained either directly for the problem or by relaxing the integrality constraints. If required, the fractional solution obtained is t...
متن کاملThe mixed vertex packing problem
We study a generalization of the vertex packing problem having both binary and bounded continuous variables, called the mixed vertex packing problem (MVPP). The well-known vertex packing model arises as a subproblem or relaxation of many 0-1 integer problems, whereas the mixed vertex packing model arises as a natural counterpart of vertex packing in the context of mixed 0-1 integer programming....
متن کاملSavelsbergh The Mixed Vertex Packing Problem
We study a generalization of the vertex packing problem having both binary and bounded continuous variables, called the mixed vertex packing problem (MVPP). The wellknown vertex packing model arises as a subproblem or relaxation of many 0-1 integer problems, whereas the mixed vertex packing model arises as a natural counterpart of vertex packing in the context of mixed 0-1 integer programming. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2019
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.10.002